Ordered SOS Pro ess Languages for Bran hing and Eager Bisimulations

Ordered SOS Process Languages for Branching and Eager Bisimulations

We present a general and uniform method for defining structural operational semantics (SOS) of process operators by traditional Plotkin-style transition rules equipped with orderings. This new feature allows one to control the order of application of rules when deriving transitions of process terms. Our method is powerful enough to deal with rules with negative premises and copying. We show tha...

Formats of Ordered SOS Rules with Silent Actions

We present a general and uniform method for deening structural operational semantics (SOS) of process algebra operators by traditional Plotkin-style rules equipped with an ordering, the new feature which states the order of application of rules when deriving transitions of process terms. Our method allows to represent negative premises and copying in the presence of silent actions. We identify ...

Synthesizing Distributed Systems

In system synthesis, we transform a spe i ation into a system that is guaranteed to satisfy the spe i ation. When the system is distributed, the goal is to onstru t the system's underlying pro esses. Results on multi-player games imply that the synthesis problem for linear spe i ations is unde idable for general ar hite tures, and is nonelementary de idable for hierar hi al ar hite tures, where...

Lax Bialgebras and Up-To Techniques for Weak Bisimulations

Up-to techniques are useful tools for optimising proofs of behavioural equivalence of processes. Bisimulations up-to context can be safely used in any language specified by GSOS rules. We showed this result in a previous paper by exploiting the well-known observation by Turi and Plotkin that such languages form bialgebras. In this paper, we prove the soundness of up-to contextual closure for we...

On Lower Bounds for Read-k-Times Bran hing Programs